The Dual Lattice , Integer Linear Systems and Hermite Normal Form
نویسندگان
چکیده
In the first Lecture, we saw that lattices can be viewed equivalently in two different ways, i.e. as discrete additive subgroup of R n or as an additive subgroup of R n with linearly independent generators. In this section, we show a final equivalent viewpoint which relates the discreteness of a lattice to the existence of an appropriate dual.
منابع مشابه
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x1, . . . , xm for the equation s = gcd (s1, . . . , sm) = x1s1 + · · · + xm...
متن کاملLecture : Integer Programming , Spring 2010
2 Euclidean Algorithm and Hermite Normal Form 9 2.1 Sizes of Rational Numbers and Polynomial Complexity . . . . . . . . . . . . 9 2.2 Computing the GCD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.3 Computing the Hermite Normal Form . . . . . . . . . . . . . . . . . . . . . . 12 2.4 Lattices and the Hermite Normal Form . . . . . . . . . . . . . . . . . . . . . 15 2.5 Dual ...
متن کاملHermite and Smith Normal Forms ofTriangular Integer Matrices
This paper considers the problem of transforming a triangular integer input matrix to canonical Hermite and Smith normal form. We provide algorithms and prove deterministic running times for both transformation problems that are linear (hence optimal) in the matrix dimension. The algorithms are easily implemented, assume standard integer multiplication, and admit excellent performance in practi...
متن کاملComputing Hermite and Smith normal forms of triangular integer matrices
This paper considers the problem of transforming a triangular integer input matrix to canonical Hermite and Smith normal form. We provide algorithms and prove deterministic running times for both transformation problems that are optimal in the matrix dimension. The algorithms are easily implemented, assume standard integer arithmetic, and admit excellent performance in practice. The results pre...
متن کاملAn Introduction to Empty Lattice Simplices
We study simplices whose vertices lie on a lattice and have no other lattice points. Suchèmpty lattice simplices' come up in the theory of integer programming, and in some combi-natorial problems. They have been investigated in various contexts and under varying terminology Can thèemptiness' of lattice simplices bèwell-characterized' ? Is theirìattice-width' small ? Do the integer points of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013